Hybrid Probabilistic Logic Programs as Residuated Logic Programs
نویسنده
چکیده
In this paper we show the embedding of Hybrid Probabilistic Logic Programs into the rather general framework of Residuated Logic Programs, where the main results of (deenite) logic programming are validly extrapolated. The importance of this result is that for the rst time a framework encompassing several quite distinct logic programming more general semantical structure paving the way for deening paracon-sistent probabilistic reasoning logic programming semantics.
منابع مشابه
Hybrid Probabilistic Logic Programs as Residuated Logic Programs
In this paper we show the embedding of Hybrid Probabilis-tic Logic Programs into the rather general framework of Residuated Logic Programs, where the main results of (deenite) logic programming are validly extrapolated, namely the extension of the immediate consequences operator of van Emden and Kowalski. The importance of this result is that for the rst time a framework encompassing several qu...
متن کاملNon-monotonic Negation in Hybrid Probabilistic Logic Programs
In [23], a new Hybrid Probabilistic Logic Programs framework has been proposed, and a new semantics has been developed to enable encoding and reasoning about real-world applications. In this paper, the language of Hybrid Probabilistic Logic Programs framework of [23] is extended to allow non-monotonic negation, and two alternative semantics are defined: stable probabilistic model semantics and ...
متن کاملA Tabulation Proof Procedure for Residuated Logic Programming
Residuated Logic Programs allow to capture a spate of different semantics dealing with uncertainty and vagueness. In this work we provide a tabulation goal-oriented query procedure, and show that our tabulation query procedure terminates if and only if the sequence of iterations of the immediate consequences operator reaches the least fixpoint after only finitely-many steps. On the basis of thi...
متن کاملHybrid Probabilistic Logic Programs with Non-monotonic Negation
1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this paper, we extend the language of Hybrid Probabilistic Logic Programs framework in [20] to allow non-monotonic negation, and define two alternative semantics: stable probabilistic model semantics and probabilistic wel...
متن کاملA tabulation procedure for first-order residuated logic programs
Residuated logic programs have shown to be a generalisation of a number of approaches to logic programming under uncertainty. Regarding automated deduction, a tabulation procedure was recently introduced for the propositional version. In this paper, we introduce a sound and complete tabulation-based proof procedure for the first-order extension of residuated logic programs.
متن کامل